Finite fields

Results: 995



#Item
331Lower Bounds on Black-Box Ring Extraction Tibor Jager and Andy Rupp ,  Horst G¨ ortz Institute for IT Security Ruhr-University Bochum, Germany

Lower Bounds on Black-Box Ring Extraction Tibor Jager and Andy Rupp , Horst G¨ ortz Institute for IT Security Ruhr-University Bochum, Germany

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-11-30 10:17:55
332

PDF Document

Add to Reading List

Source URL: msp.org

Language: English - Date: 2013-11-23 01:41:04
333PRIMES is in P Manindra Agrawal, Neeraj Kayal and Nitin Saxena∗ Department of Computer Science & Engineering Indian Institute of Technology Kanpur Kanpur, INDIA August 6, 2002

PRIMES is in P Manindra Agrawal, Neeraj Kayal and Nitin Saxena∗ Department of Computer Science & Engineering Indian Institute of Technology Kanpur Kanpur, INDIA August 6, 2002

Add to Reading List

Source URL: techheap.packetizer.com

Language: English - Date: 2002-08-09 16:45:44
334Draft  CYCLIC REDUNDANCY CHECKS IN USB Introduction The USB specification calls for the use of Cyclic Redundancy Checksums (CRC) to protect all non-PID fields in token and data packets from errors during transmission. Th

Draft CYCLIC REDUNDANCY CHECKS IN USB Introduction The USB specification calls for the use of Cyclic Redundancy Checksums (CRC) to protect all non-PID fields in token and data packets from errors during transmission. Th

Add to Reading List

Source URL: www.usb.org

Language: English - Date: 2013-12-17 18:51:22
335ID-based Authenticated Two Round Multi-Party Key Agreement

ID-based Authenticated Two Round Multi-Party Key Agreement

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2003-12-20 20:23:11
336Cryptanalysis of the RSA Subgroup Assumption from TCC 2005? Jean-S´ebastien Coron1 , Antoine Joux2,3 , Avradip Mandal1 , David Naccache4 , and Mehdi Tibouchi1,4 1 Universit´e du Luxembourg

Cryptanalysis of the RSA Subgroup Assumption from TCC 2005? Jean-S´ebastien Coron1 , Antoine Joux2,3 , Avradip Mandal1 , David Naccache4 , and Mehdi Tibouchi1,4 1 Universit´e du Luxembourg

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-12-21 02:57:04
337An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption J. Wu∗ and D.R. Stinson† David R. Cheriton School of Computer Science University of Waterloo, Waterloo, ON, Canada {j32wu, dstinson}@uwate

An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption J. Wu∗ and D.R. Stinson† David R. Cheriton School of Computer Science University of Waterloo, Waterloo, ON, Canada {j32wu, dstinson}@uwate

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-05-15 09:30:41
338Flexible Quasi-Dyadic Code-Based Public-Key Encryption and Signature Kazukuni Kobara Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST), 10F 1003, Aki

Flexible Quasi-Dyadic Code-Based Public-Key Encryption and Signature Kazukuni Kobara Research Center for Information Security (RCIS), National Institute of Advanced Industrial Science and Technology (AIST), 10F 1003, Aki

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-05-20 21:26:35
339WCCO-CRC  Date:

WCCO-CRC Date:

Add to Reading List

Source URL: gacc.nifc.gov

Language: English - Date: 2015-01-22 15:07:07
340A Simplied Quadratic Frobenius Primality Test by Martin Seysen December 20, 2005 Giesecke & Devrient GmbH Prinzregentenstr. 159, DMunich, Germany

A Simplied Quadratic Frobenius Primality Test by Martin Seysen December 20, 2005 Giesecke & Devrient GmbH Prinzregentenstr. 159, DMunich, Germany

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2005-12-20 07:14:52